Local rules and global order

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local and Global Measurements of MGRS Rules

Since the multigranulation rough sets (MGRS) can be considered as the compositions of multi– independent Pawlak’s rough sets, the multigranulation rough set rules (MGRS rules) are then the compositions of decision rules, which are supported by multi–independent Pawlak’s rough sets. To measure MGRS rules, both the local and global views are employed in this paper. In local view, the support, cer...

متن کامل

Global Order from Local Sources

This article contains introductions to three open problems of significant research interest, taken from number theory, logic, and condensed matter physics. All three problems will be shown to have at their core special cases of one simply-stated optimization problem. Our goal is to use the intuition gained from these three perspectives to direct attention to this common core, which constitutes,...

متن کامل

Deriving Global and Local Integrity Rules for a Distributed Database

An important aim of a database system is to guarantee database consistency, which means that the data contained in a database is both accurate and valid. Integrity constraints represent knowledge about data with which a database must be consistent. The process of checking constraints to ensure that update operations or transactions which alter the database will preserve its consistency has prov...

متن کامل

Fasting and diabetes from a local and global perspective- commentary

  Fasting is a common practice among people with diabetes (PWD). As healthcare providers we are in a position to assist those who choose to fast to manage their diabetes effectively. Diabetes self-management education for PWD is needed both prior and during the time of fasting to best metabolic control.  

متن کامل

Local Rules for Global MAP: When Do They Work ?

We consider the question of computing Maximum A Posteriori (MAP) assignmentin an arbitrary pair-wise Markov Random Field (MRF). We present a randomizediterative algorithm based on simple local updates. The algorithm, starting with anarbitrary initial assignment, updates it in each iteration by first, picking a randomnode, then selecting an (appropriately chosen) random local nei...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Crystallographica Section A Foundations of Crystallography

سال: 2011

ISSN: 0108-7673

DOI: 10.1107/s0108767311095407